منابع مشابه
Two-Way Two-Tape Automata
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alterna...
متن کاملPromoting Researchers and Policy-Makers Collaboration in Evidence-Informed Policy-Making in Nigeria: Outcome of a Two-Way Secondment Model between University and Health Ministry
Background There is need to strengthen institutions and mechanisms that can more systematically promote interactions between researchers, policy-makers and other stakeholders who can influence the uptake of research findings. In this article, we report the outcome of a two-way secondment model between Ebonyi State University (EBSU) and Ebonyi State Ministry of Health (ESMoH) in Nigeria as an in...
متن کاملTwo - Way Continuous Curves
A continuous curve M will be said to be a two-way continuous curve, or to be "two-way continuous," provided it is true that between every two points of M there exist in M at least two arcs neither of which is a subset of the other. A point P of a continuum M is a cut point of M provided it is true that the point set M—P is not connected. Every point of a continuum M which is not a cut point of ...
متن کاملTwo-way Replacement Selection
The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacement Selection (RS) because, on average, it generates runs that are twice the size of the memory available. However, the length of the runs generated by RS is downsized for data with certain characteristics, like inputs s...
متن کاملTropical Two-Way Automata
In this paper we study two-way min-plus automata. We prove that two-way distance automata are equivalent to one-way distance automata. In the second part of the paper we show that, with general min-plus semirings, it is decidable whether every accepted word has a weight different from −∞ and that, in contrast, it is undecidable whether there exists a word accepted with a weight different from −∞.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IALLT Journal of Language Learning Technologies
سال: 2018
ISSN: 1050-0049,1050-0049
DOI: 10.17161/iallt.v48i0.8576